Accomplishment of the key setting up: The flexible approach
نویسندگان
چکیده
The chief predicament against the accomplishment of key setup in sensor networks is the de cient fraction of the keys shared between the neighboring nodes, and the efforts to keep the nodes around their expected position becomes more inadequate in many applications. In this paper, we have focused our attention on a progressing exible polynomial pre-distribution scheme to increase the connectivity whilst maintaining standard security and communication levels even in the case of large deployment errors.
منابع مشابه
Modelling the Heterogeneous Price Setting Behavior of Firms (DSGE Approach)
Despite the empirical evidence of the difference in the degree of price stickiness of goods and services, in the new standard Keynesian models, the same price stickiness is considered for all firms producing intermediate goods. In recent years, a new generation of pricing models has been introduced to simulate the heterogeneous price setting behavior in which, unlike standard pricing models, th...
متن کاملFeasibility of setting up a health promotion and disease prevention center with a healthy aging approach
Introduction: In spite of the global trend towards increased screening efforts, there remain instances where uncertainty surrounds the cost-effectiveness of this approach. In such cases, a comprehensive assessment that considers cost-effectiveness, feasibility, and factors related to epidemiology, socio-culture, and community becomes indispensable. This assessment offers crucial insights to gui...
متن کاملPeriodic flexible maintenance planning in a single-machine production environment
Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–o...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008